Symbolic Tree Transducers
نویسندگان
چکیده
Symbolic transducers are useful in the context of web security as they form the foundation for sanitization of potentially malicious data. We define Symbolic Tree Transducers as a generalization of Regular Transducers as finite state input-output tree automata with logical constraints over a parametric background theory. We examine key closure properties of Symbolic Tree Transducers and we develop a composition algorithm and an equivalence decision procedure for linear single-valued transducers.
منابع مشابه
Equivalence of Symbolic Tree Transducers
Symbolic tree transducers are programs that transform data trees with an infinite signature. In this paper, we show that the equivalence problem of deterministic symbolic top-down tree transducers (DTop) can be reduced to that of classical DTop. As a consequence the equivalence of two symbolic DTop can be decided in NExpTime, when assuming that all operations related to the processing of data v...
متن کاملEquivalence of Extended Symbolic Finite Transducers
Symbolic Finite Transducers augment classic transducers with symbolic alphabets represented as parametric theories. Such extension enables succinctness and the use of potentially infinite alphabets while preserving closure and decidability properties. Extended Symbolic Finite Transducers further extend these objects by allowing transitions to read consecutive input elements in a single step. Wh...
متن کاملA New Algorithm for Optimization of Fuzzy Decision Tree in Data Mining
Decision-tree algorithms provide one of the most popular methodologies for symbolic knowledge acquisition. The resulting knowledge, a symbolic decision tree along with a simple inference mechanism, has been praised for comprehensibility. The most comprehensible decision trees have been designed for perfect symbolic data. Classical crisp decision trees (DT) are widely applied to classification t...
متن کاملDecision Procedures for Composition and Equivalence of Symbolic Finite State Transducers
Finite automata model a wide array of applications in software engineering, from regular expressions to specification languages. Finite transducers are an extension of finite automata to model functions on lists of elements, which in turn have uses in fields as diverse as computational linguistics and model-based testing. Symbolic finite transducers are a further generalization of finite transd...
متن کاملبررسی زبان مشترک باغ و نگارگری ایرانی با تأکید بر نقش نمادین درخت سرو
In traditional Persian Art, everything is esoteric. It means that any semblance used to refer to an abstaract meaning in a higher realm. Recognition the ideology affecting the arts is necessary to understand the language of Persian Art. The aim of this study is to investigate the structure and language of expression trees, due to the long history of symbolic role of trees in art. In this regard...
متن کامل